Case-factor diagrams for structured probabilistic modeling
نویسندگان
چکیده
منابع مشابه
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Boolean formulas that we call case-factor diagrams (CFDs). CFDs are similar to binary decision diagrams (BDDs) but are concise for circuits of bounded tree width (unlike BDDs) and can concisely represent the set of parse...
متن کامل"Ill-Structured Diagrams" for Ill-Structured Problems
While the distinction between well-structured and illstructured problems is widely recognized in cognitive science, it has not generally been noted that there are often significant differences in the external representations which accompany the two problem types. It is here suggested that there is a corresponding distinction to be made between "well-structured" and "ill-structured" representati...
متن کاملUsing Structured Knowledge Representation for Context-Sensitive Probabilistic Modeling
We propose a context-sensitive probabilistic modeling system (COSMOS) that reasons about a complex, dynamic environment through a series of applications of smaller, knowledge-focused models representing contextually relevant information. COSMOS uses a failure-driven architecture to determine whether a context is supported, and consequently whether the current model remains applicable. The indiv...
متن کاملProbabilistic Sentential Decision Diagrams
We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and canonical representation of probability distributions defined over the models of a given propositional theory. Each parameter of a PSDD can be viewed as the (conditional) probability of making a decision in a corresponding Sentential Decision Diagram (SDD). The SDD itself is a recently proposed complete and canonica...
متن کاملProbabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries
Article history: Received 9 November 2010 Received in revised form 4 February 2012 Accepted 6 February 2012 Available online 21 February 2012 A large spectrum of applications such as location based services and environmental monitoring demand efficient query processing on uncertain databases. In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.04.015